منابع مشابه
Cache-Oblivious Red-Blue Line Segment Intersection
We present an optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and a set of non-intersecting blue segments in the plane. Our algorithm uses O( B logM/B N B + T/B) memory transfers, where N is the total number of segments, M and B are the memory and block transfer sizes of any two consecutive levels of any multilevel memory hierarchy,...
متن کاملImplementatations of Algorithms For Line-Segment Intersection
In this paper, I analyze the constant factors for implementations of line segment intersection algorithms. I explore how these algorithms could be applied to stochastic local search algorithms to determine the rectilinear crossing number of complete graphs.
متن کاملLine - segment intersection made in - place ✩ Jan Vahrenhold
We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the plane. Our algorithm is an in-place variant of Balaban’s algorithm and, in the worst case, runs in O(n log2 n+ k) time using O(1) extra words of memory in addition to the space used for the input to the algorithm. © 2006 Elsevier B.V. All rights reserved.
متن کاملAn Algorithm for Computing the Convex Hull of a Set of Imprecise Line Segment Intersection
Data imprecision constitutes an important gap between theory and practice in computational geometry. A lot of research about imprecision in computational geometry is directed at computing the convex hull of imprecise points rather than imprecise line segment intersection. In this paper we introduce an algorithm to construct the convex hull for a set of imprecise line segment intersection in time.
متن کاملThe 9+-Intersection for Topological Relations between a Directed Line Segment and a Region
This paper develops a formal model of topological relations between a directed line segment (DLine) and a region in a two-dimensional space. Such model forms a foundation for characterizing movement patterns of an agent with respect to a region. The DLine-region relations are captured by the 9intersection for line-region relations with further distinction of the line’s boundary into two subpart...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing
سال: 2005
ISSN: 0010-485X,1436-5057
DOI: 10.1007/s00607-005-0120-8